The first Grushin eigenvalue on cartesian product domains
نویسندگان
چکیده
Abstract In this paper, we consider the first eigenvalue λ 1 ( Ω stretchy="false">) {\lambda_{1}(\Omega)} of Grushin operator mathvariant="normal">Δ G := x + fence="true" stretchy="false">| 2 s {\Delta_{G}:=\Delta_{x_{1}}+\lvert x_{1}\rvert^{2s}\Delta_{x_{2}}} with Dirichlet boundary conditions on a bounded domain Ω ℝ d = {\mathbb{R}^{d}=\mathbb{R}^{d_{1}+d_{2}}} . We prove that admits unique minimizer in class domains prescribed finite volume, which are cartesian product set {\mathbb{R}^{d_{1}}} and {\mathbb{R}^{d_{2}}} , is two balls * ⊆ {\Omega^{*}_{1}\subseteq\mathbb{R}^{d_{1}}} {\Omega_{2}^{*}\subseteq\mathbb{R}^{d_{2}}} Moreover, provide lower bound for {\lvert\Omega^{*}_{1}\rvert} × {\lambda_{1}(\Omega_{1}^{*}\times\Omega_{2}^{*})} Finally, limiting problem as s tends to 0 mathvariant="normal">∞ {+\infty}
منابع مشابه
Computing the First and Third Zagreb Polynomials of Cartesian Product of Graphs
Let G be a graph. The first Zagreb polynomial M1(G, x) and the third Zagreb polynomial M3(G, x) of the graph G are defined as: ( ) ( , ) [ ] e uv E G G x x d(u) + d(v) M1 , ( , ) euvE(G) G x x|d(u) - d(v)| M3 . In this paper, we compute the first and third Zagreb polynomials of Cartesian product of two graphs and a type of dendrimers.
متن کاملThe Largest First-Order-Axiomatizable Cartesian Closed Category of Domains
The inspiration for this paper is a result proved by Michael Smyth which states that Gordon Plotkin's category SFP is the largest cartesian closed category of domains. Although this category is easily enough motivated from concepts in domain theory and category theory, it is clearly harder to describe and less \elementary" than the most popular categories of domains for denotational semantics. ...
متن کاملOn the hamiltonicity of the cartesian product
We examine the hamiltonicity of the cartesian product P = G1 ×G2 of two graphs G1, G2. We provide necessary and/or sufficient conditions for P to be hamiltonian, depending on the hamiltonian properties of G1 and G2, with corresponding constructions. We also prove a conjecture by Batagelj and Pisanski related to the ‘cyclic hamiltonicity’ of a graph.
متن کاملThe reliability Wiener number of cartesian product graphs
Reliability Wiener number is a modification of the original Wiener number in which probabilities are assigned to edges yielding a natural model in which there are some (or all) bonds in the molecule that are not static. Various probabilities naturally allow modelling different types of chemical bonds because chemical bonds are of different types and it is well-known that under certain condition...
متن کاملOn Path-pairability in the Cartesian Product
9 We study the inheritance of path-pairability in the Cartesian product of 10 graphs and prove additive and multiplicative inheritance patterns of path11 pairability, depending on the number of vertices in the Cartesian product. 12 We present path-pairable graph families that improve the known upper 13 bound on the minimal maximum degree of a path-pairable graph. Further 14 results and open que...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Calculus of Variations
سال: 2023
ISSN: ['1864-8258', '1864-8266']
DOI: https://doi.org/10.1515/acv-2022-0015